Overlay Grid Based Geometry Cleanup
نویسندگان
چکیده
A newly developed system for defining watertight volume geometry on imported foreign CAD models is described. This system is based on an overlay grid mesher that is being developed in the GAMBIT preprocessing code. It is being explored as an alternative way of cleaning dirty geometries. This overlay meshing based geometry cleanup enables an automatic volume reconstruction from inconsistent B-Rep surface geometries. These inconsistencies include common edges defined twice, small gaps, holes and overlapping of faces. This new approach holds the promise of higher automation levels, speed and robustness when compared to more traditional interactive cleanup methodologies.
منابع مشابه
Grid Resource Discovery Algorithm of the Multi-Layer Overlay Network Model Based on Distance
The resource discovery mechanism is a hot topic issue in grid environments and It has great impact on the efficiency of the resource sharing and cooperative computing. Based on the domain and resource routing nodes, a grid resource discovery model of multilayer overlay network was given in this paper. And on this basis, using a linear combination of the block distance and chessboard distance in...
متن کاملAll-Hex Meshing of Multiple-Region Domains without Cleanup.
In this paper, we present a new algorithm for all-hex meshing of domains with multiple regions without post-processing cleanup. Our method starts with a strongly balanced octree. In contrast to snapping the grid points onto the geometric boundaries, we move points a slight distance away from the common boundaries. Then we intersect the moved grid with the geometry. This allows us to avoid creat...
متن کاملGrid Resource Discovery Algorithm Based on Distance
Resource discovery in a Grid environment is a critical problem and also a fundamental task which provides searching and locating necessary resources for given processes. Based on the domain and resource routing nodes, a grid resource discovery model of multilayer overlay network is given in this paper. And on this basis, using a linear combination of the block distance and chessboard distance i...
متن کاملConstructing Anisotropic Geometric Metrics using Octrees and Skeletons
A three-dimensional anisotropic metric for geometry-based mesh adaptation is constructed from a triangulated domain definition. First, a Cartesian background octree is refined according to not only boundary curvature but also a local separation criterion from digital topology theory. This octree is then used to extract the domain skeleton through a medial axis transform. Finally, an efficient a...
متن کاملAll-quad meshing without cleanup
We present an all-quad meshing algorithm for general domains. We start with a strongly balanced quadtree. In contrast to snapping the quadtree corners onto the geometric domain boundaries, we move them away from the geometry. Then we intersect the moved grid with the geometry. The resulting polygons are converted into quads with midpoint subdivision. Moving away avoids creating any flat angles,...
متن کامل